The language of Stratified Sets is confluent and strongly normalising
نویسنده
چکیده
We study the properties of the language of Stratified Sets (first-order logic with ∈ and a stratification condition) as used in TST, TZT, and (with stratifiability instead of stratification) in Quine’s NF. We find that the syntax forms a nominal algebra for substitution and that stratification and stratifiability imply confluence and strong normalisation under rewrites corresponding naturally to β-conversion.
منابع مشابه
Normal Forms and Reduction for Theories of Binary Relations
We consider equational theories of binary relations, in a language expressing composition, converse, and lattice operations. We treat the equations valid in the standard model of sets and also define a hierarchy of equational axiomatisations stratifying the standard theory. By working directly with a presentation of relation-expressions as graphs we are able to define a notion of reduction whic...
متن کاملA Strongly Normalising Curry-Howard Correspondence for IZF Set Theory
We propose a method for realising the proofs of Intuitionistic Zermelo-Fraenkel set theory (IZF) by strongly normalising λ-terms. This method relies on the introduction of a Curry-style type theory extended with specific subtyping principles, which is then used as a low-level language to interpret IZF via a representation of sets as pointed graphs inspired by Aczel’s hyperset theory. As a conse...
متن کاملZero sets in pointfree topology and strongly $z$-ideals
In this paper a particular case of z-ideals, called strongly z-ideal, is defined by introducing zero sets in pointfree topology. We study strongly z-ideals, their relation with z-ideals and the role of spatiality in this relation. For strongly z-ideals, we analyze prime ideals using the concept of zero sets. Moreover, it is proven that the intersection of all zero sets of a prime ideal of C(L),...
متن کاملComplete term rewrite systems for decimal arithmetic and other total recursive functions
We present a strongly normalising and confluent term rewrite system which describes addition, subtraction, and multiplication of positive and negative integers represented in base 10. We prove a general theorem giving an easily checkable syntactic condition on term rewrite systems which implies strong normalisation. The rewrite system for decimal arithmetic satisfies the condition. The method i...
متن کاملStrong Normalisation for Applied Lambda Calculi
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting ⊥ is strongly normalising provided all its ‘stratified approximations’ are. From this we derive a general normalisation theorem for applied typed λ-calculi: If all constants have a total value, then all typeable terms are strongly nor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1705.07767 شماره
صفحات -
تاریخ انتشار 2017